context - free language造句
例句與造句
- Type-2 grammars generate the context-free languages.
- Extended context-free grammars describe exactly the context-free languages.
- There exists a Pumping lemma for context-free languages.
- Context-free languages are not closed under difference.
- Not all context-free languages are deterministic.
- It's difficult to find context - free language in a sentence. 用context - free language造句挺難的
- CD is eliminated from the above, then one obtains context-free languages.
- Let L be a context-free language.
- Thus, every context-free language is commutatively equivalent to some regular language.
- Earley parsers are appealing because they can parse all context-free languages reasonably efficiently.
- Parser algorithms for context-free languages include the CYK algorithm and Earley's Algorithm.
- Description : LR parser, which does bottom up parsing for deterministic context-free languages.
- Since the context-free languages form a cone, they are closed under this exotic operation.
- The language of strings accepted by a deterministic pushdown automaton is called a deterministic context-free language.
- Both properly contain the context-free languages and are properly contained in the family of quasirealtime languages.
- Deterministic context-free languages can be recognized by a deterministic Turing machine in polynomial time and complement.
更多例句: 下一頁